Preconditioned Iterative Methods for Weighted Toeplitz Least Squares Problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Preconditioned Iterative Methods for Weighted Toeplitz Least Squares Problems

We consider the iterative solution of weighted Toeplitz least squares problems. Our approach is based on an augmented system formulation. We focus our attention on two types of preconditioners: a variant of constraint preconditioning, and the Hermitian/skew-Hermitian splitting (HSS) preconditioner. Bounds on the eigenvalues of the preconditioned matrices are given in terms of problem and algori...

متن کامل

Preconditioned Iterative Methods for Solving Linear Least Squares Problems

New preconditioning strategies for solving m × n overdetermined large and sparse linear least squares problems using the CGLS method are described. First, direct preconditioning of the normal equations by the Balanced Incomplete Factorization (BIF) for symmetric and positive definite matrices is studied and a new breakdown-free strategy is proposed. Preconditioning based on the incomplete LU fa...

متن کامل

Fast Iterative Methods for Solving Toeplitz-plus-hankel Least Squares Problems∗

In this paper, we consider the impulse responses of the linear-phase filter whose characteristics are determined on the basis of an observed time series, not on a prior specification. The impulse responses can be found by solving a least squares problem min ‖d − (X1 + X2)w‖2 by the fast Fourier transform (FFT) based preconditioned conjugate gradient method, for (M +2n−1)by-n real Toeplitz-plus-...

متن کامل

Comparison Results on Preconditioned GAOR Methods for Weighted Linear Least Squares Problems

We present preconditioned generalized accelerated overrelaxation methods for solving weighted linear least square problems. We compare the spectral radii of the iteration matrices of the preconditioned and the original methods. The comparison results show that the preconditioned GAOR methods converge faster than the GAOR method whenever the GAOR method is convergent. Finally, we give a numerica...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications

سال: 2006

ISSN: 0895-4798,1095-7162

DOI: 10.1137/040616048